Interconnected WDM Ring Networks: Strategies for Interconnection and Traffic Grooming*
نویسندگان
چکیده
In telecommunication networks, SONET self -healing rings are widely deployed as transport infrastructure. Typically, multiple rings are interconnected together to provide a large geographical coverage. A typical network-planning problem of traffic grooming deals with packing several TDM sub-channels into high-speed wavelength channels in a WDM ring with the goal of saving SONET equipment usage. The two problems of how to interconnect WDM ring networks as well as how to groom the traffic in interconnected rings are addressed. We compare four interconnection strategies rangin g from using traditional Digital Crossconnects to using innovative Optical Crossconnects. We present both formal mathematical formulations and detailed heuristic approaches for solving the traffic -grooming problems in interconnected rings. Our quantitative results show that TDM-level switching is useful when the number of sub-channels in a wavelength is neither too small nor too large, while pure optical switching may be a better choice for other cases. A mixed switching architecture can achieve maximum ben efit by adopting a winning strategy from the above two approaches.
منابع مشابه
WDM ring networks : strategies for interconnection and traffic grooming
Jian Wang Biswanath Mukherjee Networks Laboratory Computer Science Department University of California Davis, CA USA
متن کاملEffective traffic grooming in WDM rings
Much work has focused on traffic grooming in WDM ring networks. Previous work has considered many aspects of traffic grooming, including minimizing number of ADMs, minimizing number of wavelengths, single hub and multiple hub architectures, switching capabilities etc. In this work, we derive general and tighter bounds on the number of wavelengths in WDM ring networks that may be capable of swit...
متن کاملInter - Semester 2011 Handout 13 1 5 Traffic Grooming inWavelength - RoutedWDMNet
In the last chapter, we assume that each source-destination (s-d) pair has its taffic demand equal to an integer multiple of wavelength unit. Accordingly, supporting such traffic in transparent wavelength division multiplexing (WDM) networks can be done by establishing lightpaths between s-d pairs. In addition, these established lightpaths will be fully utilized. In this chapter, we allow for s...
متن کاملA Dynamic Traffic Grooming Algorithm in Multi-granularity Heterogeneous Optical WDM Mesh Networks
We consider the problem of traffic grooming in wavelength division multiplexing networks. Our objective is to minimize the required number of electronic add-drop multiplexers. We investigate the problem of efficiently provisioning connections of different bandwidth granularities in a heterogeneous WDM mesh network through dynamic traffic grooming schemes under traffic engineering principles. We...
متن کاملDynamic traffic grooming in WDM mesh networks using a novel graph model
As our fiber-optic backbone networks migrate from interconnected SONET rings to arbitrary mesh topology, traffic grooming on WDM mesh networks becomes an extremely important research problem. (Traffic grooming refers to the problem of efficiently packing a set of low-speed connection requests onto high-capacity channels.) To address this problem, we employ a new, generic graph model for dynamic...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002